An Improved Genetic Algorithm with Initial Population Strategy for Symmetric TSP
نویسندگان
چکیده
منابع مشابه
The Greedy Algorithm for the Symmetric TSP
We corrected proofs of two results on the greedy algorithm for the Symmetric TSP and answered a question in Gutin and Yeo, Oper. Res. Lett. 30 (2002), 97–99.
متن کاملAn Improved Randomized Approximation Algorithm for Max TSP
We present an O(n)-time randomized approximation algorithm for the maximum traveling salesman problem whose expected approximation ratio is asymptotically 251 331 , where n is the number of vertices in the input (undirected) graph. This improves the previous best.
متن کاملAn Improved Ant Colony Optimization Algorithm for Solving TSP
The basic ant colony optimization (ACO) algorithm takes on a longer computing time in the search process and is prone to fall into local optimal solutions, an improved ACO (CEULACO) algorithm is proposed in this paper. In the CEULAC algorithm, the direction guidance and real variable function are used to initialize pheromone concentration according to the path information of undirected graph. T...
متن کاملAn Improved Exact Algorithm for Cubic Graph TSP
It is shown that the traveling salesman problem for graphs of degree at most three with n vertices can be solved in time O(1.251), improving the previous bound O(1.260) by Eppstein.
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/212794